منابع مشابه
Homomorphism Reconfiguration via Homotopy
For a fixed graph H, we consider the H-Recoloring problem : given a graph G and two H-colorings of G, i.e., homomorphisms from G to H, can one be transformed into the other by changing one color at a time, maintaining an H-coloring throughout. This is the same as finding a path in the Hom(G,H) complex. For H = Kk this is the problem of finding paths between k-colorings, which was recently shown...
متن کاملStable Homotopy and the J-Homomorphism
Acknowledgements I would like to thank my advisor, Prof. Michael Hopkins, for introducing me to the beautiful world of stable homotopy theory. I am grateful for the wisdom he shared, and for the time and energy he took out of a busy life to start one student down the road of curiosity and amazement. I would also like to thank my parents for their unflagging moral support, and my friends for bei...
متن کاملGraph Homomorphism Reconfiguration and Frozen H-Colourings
For a fixed graph $H$, the reconfiguration problem for $H$-colourings (i.e. homomorphisms to $H$) asks: given a graph $G$ and two $H$-colourings $\varphi$ and $\psi$ of $G$, does there exist a sequence $f_0,\dots,f_m$ of $H$-colourings such that $f_0=\varphi$, $f_m=\psi$ and $f_i(u)f_{i+1}(v)\in E(H)$ for every $0\leq i<m$ and $uv\in E(G)$? If the graph $G$ is loop-free, then this is the equiva...
متن کاملHomomorphism between AOMRC and Hoare Model of Deterministic Reconfiguration Processes in Reconfigurable Computing Systems
In this paper, the notion of aspect-oriented modular reconfigurable computing (AOMRC) is introduced, CSP-based behaviors of AOMRC are approached by developing a model of AOMRC and constructing a Hoare model of deterministic reconfiguration processes. Then, under the theory of coalgebras, we build a homomorphism between AOMRC and a Hoare model of deterministic reconfiguration processes. In other...
متن کاملFinite Homomorphism-Homogeneous Permutations via Edge Colourings of Chains
A relational structure is homomorphism-homogeneous if any homomorphism between its finite substructures extends to an endomorphism of the structure in question. In this note, we characterise all permutations on a finite set enjoying this property. To accomplish this, we switch from the more traditional view of a permutation as a set endowed with two linear orders to a different representation b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1122578